Time complexity - PDFSEARCH.IO - Document Search Engine

Time complexity
Results: 894

#	Item
351	How to Put Through Your Agenda in Collective Binary Decisions? Noga Alon1 , Robert Bredereck2 , Jiehua Chen2 , Stefan Kratsch2 Rolf Niedermeier2 , and Gerhard J. Woeginger3 2 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-10-23 10:13:29 Complexity classes NP-complete problems Analysis of algorithms Parameterized complexity Mathematical optimization Vertex cover Dominating set Time complexity FO Theoretical computer science Computational complexity theory Applied mathematics
352	Approximation Algorithms Recap Advanced Algorithms – COMS31900 A polynomial time algorithm A is an α-approximation for problem P if, it always outputs a solution s with Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes NP-complete problems Bin packing problem Approximation algorithms Discrete geometry Packing problem Polynomial-time approximation scheme Time complexity Bin Theoretical computer science Computational complexity theory Applied mathematics
353	Approximation Algorithms Recap Advanced Algorithms – COMS31900 An algorithm A is an α-approximation for problem P if, Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Bin packing problem Approximation algorithm Polynomial-time approximation scheme Subset sum problem NP PP Time complexity P Theoretical computer science Computational complexity theory Applied mathematics
354	Advanced Algorithms – COMS31900Lecture 18 Approximation Algorithms (part three) (Fully) Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 NP-complete problems Dynamic programming Subset sum problem Bin packing problem Approximation algorithm Complexity classes Combinatorial optimization NP Partition problem Theoretical computer science Computational complexity theory Applied mathematics
355	Advanced Algorithms – COMS31900Lecture 16 Approximation Algorithms (part one) P, NP and constant factor approximations Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:21 Applied mathematics NP-complete NP-hard P versus NP problem NP Polynomial-time reduction P Complete Reduction Theoretical computer science Computational complexity theory Complexity classes
356	C HICAGO J OURNAL OF T HEORETICAL C OMPUTER S CIENCE 2012, Article 07, pages 1–24 http://cjtcs.cs.uchicago.edu/ Computational Models with No Linear Speedup Amir M. Ben-Amram Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2012-12-14 16:46:25 Computability theory Computational complexity theory Computational resources Models of computation Linear speedup theorem Universal Turing machine Speedup theorem DTIME Time complexity Theoretical computer science Applied mathematics Turing machine
357	PDF Document Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-21 04:05:40 Polynomials Algebraic geometry Commutative algebra Computer algebra System of polynomial equations Finite field NP Time complexity Elliptic curve only hash Abstract algebra Mathematics Algebra
358	Multivariate Algorithmics for NP-Hard String Problems Laurent Bulteau∗ Falk Hüffner† Christian Komusiewicz Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-01-11 10:59:55 NP-complete problems Complexity classes Analysis of algorithms String Closest string Parameterized complexity Kernelization Time complexity Vertex cover Theoretical computer science Computational complexity theory Applied mathematics
359	Advanced Algorithms – COMS31900Lecture 19 Approximation Algorithms (part four) Asymptotic Polynomial Time Approximation Schemes Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 09:18:22 Complexity classes Approximation algorithms NP-complete problems Polynomial-time approximation scheme Time complexity NP PTAS L-reduction APX Theoretical computer science Computational complexity theory Applied mathematics
360	Introduction The Problem Results Future Directions Factorising the `th Cyclotomic Polynomial over Fp Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:10 Complexity classes P Algorithm Time complexity Cyclotomic field Cyclotomic polynomial Theoretical computer science Applied mathematics Mathematics

UPDATE